Realisability of Branching Pomsets
نویسندگان
چکیده
A communication protocol is realisable if it can be faithfully implemented in a distributed fashion by communicating agents. Pomsets offer way to compactly represent concurrency protocols and have been recently used for the purpose of realisability analysis. In this paper we focus on introduced branching pomsets, which also choices. We define well-formedness conditions inspired multiparty session types, prove that pomset sufficient condition represented protocol.
منابع مشابه
Teams can see pomsets
Strings may serve as both specifications and observations of behavior. However partial strings or pomsets, superior to strings in certain respects for the representation of concurrent behavior, are provably unobservable and hence apparently suitable only for specifying behavior. The proof however tacitly assumes that observers are isolated individuals. We show that observations by a cooperating...
متن کاملAn Algebra for Pomsets
We study languages for manipulating partially ordered structures with duplicates (e.g. trees, lists). As a general framework, we consider the pomset (partially ordered multiset) data type. We introduce an algebra for pomsets, which generalizes traditional algebras for (nested) sets, bags and lists. This paper is motivated by the study of the impact of diierent language primitives on the express...
متن کاملThe Equational Theory of Pomsets
Pomsets have been introduced as a mode2 of concurrency. Since a pomset is a string in which the total order has been relaxed to be a partial order, in this paper we view them as a generalization cf Strings, and investigate their algebraic properties. In particular, we investigate the axiomatic properties of pornsets, sets of pomsets and ideals of pornsets, under such operations as concatenation...
متن کاملRealisability of Production Recipes
There is a rising demand for customised products with a high degree of complexity. To meet these demands, manufacturing lines are increasingly becoming autonomous, networked, and intelligent, with production lines being virtualised into a manufacturing cloud, and advertised either internally to a company, or externally in a public cloud. In this paper, we present a novel approach to two key pro...
متن کاملFocalisation and Classical Realisability
We develop a polarised variant of Curien and Herbelin’s λ̄μμ̃ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised when cut-free), such as Girard’s classical logic LC or linear logic. This gives a setting in which Krivine’s classical realisability extends naturally (in particular to callby-value), with a presentation in terms of orthogonal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-20872-0_11